Decoding device, decoding method, and memory system

ABSTRACT

According to an embodiment, a decoding device includes a check node processor, and a converter. The probability acquirer is configured to acquire. The check node processor is configured to perform check node processing during in a decoding operation of encoded data. A probability value for each bit of the encoded data is treated as an initial variable node in the check node processing. The converter is configured to convert, into bit values, updated values of the probability values based on the check node processing. The check node processor includes a check node circuit having a topology corresponding to a two-state trellis diagram representing the check node processing. The check node circuit includes conducting wires each corresponding to an edge of the two-state trellis diagram and includes switch units which are arranged on the conducting wires and switching of which is controlled according to a predetermined probability.

CROSS-REFERENCE TO RELATED APPLICATION

This application is based upon and claims the benefit of priority from Japanese Patent Application No. 2014-192611, filed on Sep. 22, 2014; the entire contents of which are incorporated herein by reference.

FIELD

Embodiments described herein relate generally to a decoding device, a decoding method, and a memory system.

BACKGROUND

An LDPC code (LDPC stands for Low-Density Parity-Check) is known as an encoding method that has a strong error correction/encoding capacity and that is used in communication systems and memory devices. An LDPC code uses a parity check matrix and repeatedly performs message value calculation called row processing and column processing; and performs decoding by obtaining the posterior probability of received-word data. From among the existing types of error correction codes, an LDPC code has the error correction capacity close to the theoretical limit. For that reason, the LDPC code is widely used in communication systems and storage devices.

Meanwhile, regarding the flash memory that, in recent years, has become mainstream as far as nonvolatile semiconductor memory devices are concerned, miniaturization of memory cells and multi-bit per cell architecture have escalated the errors occurring during reading. For that reason, the error correction capacity of the conventional BCH code (BCH stands for Bose, Chandhuri, Hocquenghem) has become insufficient. Thus, in recent years, a lot of attention is being focused on the LDPC codes having a higher error correction capacity. Besides, in order to retain the intergenerational compatibility among the error correction methods, there has been a demand for a technology providing an on-chip decoding circuit for decoding the LDPC codes. As a result of providing an on-chip decoding technology, the LDPC code decoding operation can be performed using a circuit arranged on the chip on which the semiconductor memory device is formed. As a result, the apparent error occurrence rate of the semiconductor memory device can be held down to a certain level or lower.

Meanwhile, since an LDPC code performs probability-based error correction, it becomes necessary to perform complex real number calculation. Particularly, in the check node processing performed during the calculations for decoding an LDPC code, it is necessary to perform product-sum operations of probability values, thereby requiring a large amount of calculation resources. Hence, in order to implement the decoding operation for an LDPC code using hardware, a large-scale digital semiconductor circuit is required. That makes on-chip implementation a difficult task.

In that regard, in order to downscale the semiconductor circuit that performs decoding of an LDPC code, a method has been proposed in which the real numbers are expressed as electrical current and the real number calculation is performed using analog circuitry. However, in the case of expressing data values as electrical current, electrical current must continuously flow during the data processing. That leads to consumption of an enormous amount of electrical power.

In this way, in order to achieve a sufficient error correction capacity in an LDPC code using the conventional technology, it is necessary to perform the decoding operation using real number calculation. However, because of that, it becomes complex to implement an error correction device using a semiconductor integrated circuit.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a block diagram schematically illustrating an exemplary configuration of a memory system that includes a decoding device according to embodiments;

FIG. 2 is a diagram illustrating an exemplary Tanner graph expressing a check matrix;

FIG. 3 is a block diagram illustrating an exemplary configuration of a decoder that can be implemented in the embodiments;

FIG. 4 is a block diagram illustrating an exemplary configuration of a check node processor that can be implemented in the embodiments;

FIG. 5 is a diagram for explaining check node processing that can be implemented in the embodiments;

FIG. 6 is a two-state trellis diagram that can be implemented in the embodiments;

FIG. 7 is a diagram illustrating an exemplary path starting from the starting node to the end node in a two-state trellis diagram;

FIG. 8 is a diagram illustrating an exemplary configuration of a check node circuit according to a first embodiment;

FIGS. 9 and 10 are diagrams illustrating exemplary states during the operations of switches in the check node circuit according to the first embodiment;

FIG. 11 is a diagram illustrating results of performing error correction of 981 bits using a 981×500 check matrix;

FIG. 12 is a circuit diagram illustrating an example of a check node circuit according to a second embodiment;

FIGS. 13 and 14 are diagrams illustrating examples in which the check node circuit according to the second embodiment is configured with NMOS transistors and PMOS transistors;

FIG. 15 is a diagram illustrating an exemplary configuration of a probability signal generator according to a third embodiment;

FIG. 16 is a diagram illustrating an exemplary configuration of a check node circuit in which the probability signal generators according to the third embodiment are used;

FIG. 17 is a diagram illustrating an example of the current-voltage characteristic of the Dipolar resistance switching phenomenon occurring due to TaO_(x);

FIG. 18 is a diagram illustrating an exemplary relationship between the switching period and the cumulative probability of a resistance switch element in which TaO_(x) is used;

FIGS. 19 and 20 are diagrams illustrating examples in which the check node circuit according to the third embodiment is configured with NMOS transistors and PMOS transistors;

FIG. 21 is a diagram illustrating an exemplary configuration of a probability signal generator according to a first modification example of the third embodiment;

FIG. 22 is a diagram illustrating an example of a check node circuit in which the probability signal generator according to the first modification example of the third embodiment is used;

FIGS. 23, 24A and 24B are diagrams illustrating examples in which the check node circuit according to the first modification example of the third embodiment is configured with NMOS transistors and PMOS transistors;

FIG. 25 is a diagram illustrating a characteristic example of a threshold-switch-type selector according to a second modification example of the third embodiment;

FIG. 26 is a diagram illustrating an example of a check node circuit in which the probability signal generator according to the second modification example of the third embodiment is used;

FIG. 27 is a diagram illustrating an example in which the check node circuit according to the second modification example of the third embodiment is configured with NMOS transistors and PMOS transistors;

FIG. 28 is a diagram illustrating an example of a check node circuit in which the probability signal generator according to another example of the second modification example of the third embodiment is used;

FIG. 29 is a diagram illustrating an example in which the check node circuit according to the other example of the second modification example of the third embodiment is configured with NMOS transistors and PMOS transistors;

FIG. 30 is a diagram illustrating an exemplary configuration of a probability signal generator according to a third modification example of the third embodiment;

FIG. 31 is a diagram illustrating an example of a check node circuit in which the probability signal generator according to the third modification example of the third embodiment is used;

FIG. 32 is a diagram illustrating an example in which the check node circuit according to the third modification example of the third embodiment is configured with NMOS transistors and PMOS transistors;

FIG. 33 is a circuit diagram illustrating an example of a check node circuit according to a fourth embodiment;

FIG. 34 is a circuit diagram illustrating an example of a check node circuit according to a first example of a modification example of the fourth embodiment;

FIG. 35 is a circuit diagram illustrating an example of a check node circuit according to a second example of the modification example of the fourth embodiment;

FIG. 36 is a circuit diagram illustrating an example of a check node circuit according to a third example of the modification example of the fourth embodiment;

FIG. 37 is a circuit diagram illustrating an example of a check node circuit according to a fourth example of the modification example of the fourth embodiment; and

FIG. 38 is a diagram illustrating an example of a communication system that can be implemented in the fifth embodiment.

DETAILED DESCRIPTION

According to an embodiment, a decoding device includes a probability acquirer, a check node processor, and a converter. The probability acquirer is configured to acquire a probability value for each bit of encoded data received. The check node processor is configured to perform check node processing during in a decoding operation of the encoded data. The probability values are treated as initial variable nodes in the check node processing. The converter is configured to convert, into bit values, updated values of the probability values which are updated based on a result of the check node processing. The check node processor includes a check node circuit having a topology corresponding to a two-state trellis diagram representing the check node processing. The check node circuit includes conducting wires each corresponding to an edge of the two-state trellis diagram and includes switch units which are arranged on the conducting wires and switching of which is controlled according to a predetermined probability. Based on presence or absence of conduction between a first terminal in the check node circuit corresponding to a starting node of the two-state trellis diagram and a second terminal in the check node circuit corresponding to an end node of the two-state trellis diagram, the check node processor performs check node processing with respect to the variable nodes corresponding to the check node circuit.

Given below is the explanation about a decoding device according to embodiments. The decoding device according to the embodiments performs decoding of a low-density parity-check code (LDPC code). In FIG. 1 is schematically illustrated an exemplary configuration of a memory system that includes a decoding device according to the embodiments.

With reference to FIG. 1, a memory system 1 includes a memory unit 2, an encoder 3, and a decoder 4. Firstly, input data 5 is input to the encoder 3. Then, the encoder 3 encodes the input data 5 into an LDPC code, and sends the LDPC code to the memory unit 2 that includes, for example, a controller and a memory medium. Thus, the LDPC code that is sent to the memory unit 2 is written in the memory medium by the controller. In the embodiments, it is assumed that a flash memory is used as the memory medium.

Meanwhile, for example, when the memory unit 2 receives a read request from outside, the controller reads the LDPC code from the memory medium and sends it to the decoder 4. Then, the decoder 4 decodes the LDPC code; restores the original input data 5; and outputs the restored input data 5 as output data 6 from the memory system 1.

When a flash memory is used as the memory medium, reading of information is done depending on whether the threshold voltage is high or low.

Given below is the explanation about LDPC codes. An LDPC code is characterized by a low-density matrix called a check matrix in which majority of the components are equal to 0 and only a small number of components are equal to 1. Depending on the code length, a large check matrix is required. However, for the sake of illustration, the following explanation is given about an 8×4 check matrix. An example of a check matrix H is given below in Equation (1).

$\begin{matrix} {H = \begin{bmatrix} 0 & 1 & 0 & 1 & 1 & 0 & 0 & 1 \\ 1 & 1 & 1 & 0 & 0 & 1 & 0 & 0 \\ 0 & 0 & 1 & 0 & 0 & 1 & 1 & 1 \\ 1 & 0 & 0 & 1 & 1 & 0 & 1 & 0 \end{bmatrix}} & (1) \end{matrix}$

In the check matrix H, the count of 1 present in each row and each column is called weight, and the check matrix is created in such a way that the weights in all columns and all rows are greater than zero. When the column weight and the row weight are constant values, the check matrix is called a regular matrix. In the check matrix H given in Equation (1), all column weights are equal to four and all row weights are equal to two. Hence, the check matrix H is a regular matrix.

In the LDPC method, a data string x that is to be sent through a communication path or that is to be stored in a memory is converted into a data string c that satisfies Hc^(T)=0. This data string c is called a code. Thus, in the LDPC method, the data used in information processing is not the original data string x but is the code c obtained by conversion. The encoder 3 performs a conversion operation with respect to the data string containing the input data 5. The memory unit 2 writes the code c, which is obtained by conversion of the input data 5, in the flash memory.

Generally, the code c represents a data sting having a greater data length than the data string x and contains, in addition to the information included in the data string x, information required in performing error correction. Meanwhile, encoding itself represents mapping with one-to-one correspondence. Thus, if the data string z is provided, the code gets uniquely determined. Conversely, if the code c is provided, the original data string x gets uniquely determined. Moreover, (the length of the data string x)/(the length of the code c) is called a code rate. Herein, it can be said that, higher the code rate, the higher is the efficiency of the error correction.

The check matrix H can be expressed using a Tanner graph illustrated in FIG. 2. In the Tanner graph, nodes {c₀, c₁, . . . , c₇} are arranged below nodes {f₀, f₁, f₂, f₃}. Then, regarding a component h_(ij) of the check matrix H, only when the component h_(ij)=1 holds true, the nodes are connected by straight lines. In the Tanner graph, nodes {c_(k)} are called variable nodes, and nodes {f_(j)} are called check nodes. Each of the variable nodes c_(i) corresponds to a row of the check matrix H; and the row numbers of the rows having the value “1” matches with the numbers assigned to the check nodes f_(j) that are connected to the concerned variable node c_(i). On the other hand, each of the check nodes f_(j) corresponds to a column of the check matrix H; and the column numbers of the columns having the value “1” matches with the numbers assigned to the variable nodes c_(i) that are connected to the concerned check node f_(j).

Given below is the explanation of the basic decoding operation performed with respect to an LDPC code. Herein, the explanation is given with reference to the belief propagation (BP) method. It is assumed that the decoding operation explained below is performed by, for example, the decoder 4. Thus, the decoder 4 reads the code stored in the memory unit 2, decodes the code, and restores the original data.

In FIG. 3 is illustrated an exemplary configuration of the decoder 4 that can be implemented in the embodiments. The decoder 4 includes a threshold value reader 511, a threshold value/probability converter 512, an initial probability storage 513, a provisional probability storage 514, a variable node processor 515, a check node processor 516, a probability/bit converter 517, and a parity checker 518.

With reference to FIG. 3, a memory 510 corresponds to the memory unit 2 illustrated in FIG. 1; and the threshold value reader 511 reads, from the memory unit 2, the threshold voltage during reading. Based on the threshold voltage obtained by the threshold value reader 511, the threshold value/probability converter 512 obtains, with respect to the bit string that has been read, a bit-by-bit probability indicating the likelihood; and converts the threshold voltage into a probability. Herein, the bit-by-bit probability value obtained by the threshold value/probability converter 512 is stored in the initial probability storage 513.

The probability values stored in the initial probability storage 513 are stored as provisional probabilities in the provisional probability storage 514 and are sent to the variable node processor 515. The check node processor 516 refers to the provisional probabilities read from the provisional probability storage 514; distributes the provisional probabilities in groups according to the check matrix H; performs probability calculation in each group by following encoding rules; and performs calculations of the check node processing. The variable node processor 515 receives a notification from the check node processor 516 about the group-by-group check node processing result and tallies the results. Then, the variable node processor 515 updates the probability values stored in the provisional probability storage 514 with the post-tallying probability values.

The probability/bit converter 517 determines whether or not the probability values stored in the provisional probability storage 514 are satisfying the parity condition. If the probability values are satisfying the parity condition, then the probability/bit converter 517 converts the probability values into bit values and obtains a bit string. Herein, until the determination result indicates that the parity condition is satisfied, the check node processor 516 repeatedly performs the check node processing. The parity checker 518 performs a parity check with respect to the bit string obtained by conversion by the probability/bit converter 517 and, if no error is detected, sends the bit string to an output unit 519 that includes, for example, a buffer memory.

In FIG. 4 is illustrated an exemplary configuration of the check node processor 516 that can be implemented in the embodiments. In FIG. 4, the common portion with FIG. 3 is referred to by the same reference numerals and the detailed explanation is not repeated. The check node processor 516 includes a probability/switch-actuating-signal converter 530; a plurality of parity checkers 531 a to 531 d; and counters 532 a to 532 d that are supplied with the output of the parity checkers 531 a to 531 d, respectively.

The probability/switch-actuating-signal converter 530 distributes the provisional probability values, which are stored in the provisional probability storage 514, according to the check matrix H and sends them to the parity checkers 531 a to 531 d. Using the received probability values, the parity checkers 531 a to 531 d perform the check node processing, that is, perform probability calculation according to encoding rules. Then, the counters 532 a to 532 d count the results of calculation; and the variable node processor 515 tallies the counting results of the counters 532 a to 532 d according to the check matrix H.

Given below is the more detailed explanation about the basic decoding operation performed in the LDPC code. Firstly, regarding {y_(i)} that represents a column y having a particular physical quantity, each variable node c_(i) receives a probability Q_(0i) having “0” as the digital value corresponding to the value y_(i). Herein, the digital data values that are stored are, for example, the original data values of the code stored in the memory unit 2. Then, each variable node c_(i) sends, as information q_(ij), the probability Q_(0i) to a check node f_(j) to which that variable node c_(i) is connected (see (a) in FIG. 5).

The check node f_(j) calculates, based on information q={q_(ij), q_(kj), . . . } sent from the variable nodes {c_(i), c_(k), . . . } connected thereto and by taking into account the parity condition, probabilities {r_(ji), r_(jk), . . . } at which the variable nodes {c_(i), c_(k), . . . } have “1” as the digital data value; and sends back the probabilities {r_(ji), r_(jk), . . . } to the variable nodes {c_(i), c_(k), . . . } (see (b) in FIG. 5).

At the time of calculating the probability r_(ji) that is to be sent back to the variable node c_(i), the check node f_(j) excludes the information q_(ij) received from the variable node c_(i). That is, as a result of receiving the probability r_(ji), the variable node c_(i) receives information of the variable nodes except for itself. More particularly, the check node f_(j) performs the check node processing according to Equation (2) given below and calculates the probability r_(ji). In Equation (2), a value A(j) represents a set of subscripts {i, k, . . . } of the variable nodes that are connected to the check node f_(j).

$\begin{matrix} {r_{ji} = {\frac{1}{2} + {\frac{1}{2}{\prod\limits_{k \in {{A{(j)}} - {(i)}}}\left( {1 - {2q_{kj}}} \right)}}}} & (2) \end{matrix}$

The variable node c_(i) refers to the probabilities {r_(ji), r_(ki), . . . }, which are received from the check nodes {f_(j), f_(k), . . . } connected thereto, as well as refers to its own probability Q_(0i); and calculates a probability Q′_(i) at which the value of the received data was originally equal to “0”. As a result of calculations, if the probability Q′_(i) is equal to or greater than half, then the variable node c_(i) presumes that the value of the received data is “1”. However, if the probability Q′_(i) is smaller than half, then the variable node c_(i) presumes that the value of the received data is “0”.

During the error correction according to the LDPC method, the parity check is performed using the presumed value. More particularly, with respect to a presumed-value string c_(temp)={c_(0temp), c_(1temp), . . . }, it is determined whether or not Hc_(temp) ^(T)=0 holds true. If Hc_(temp) ^(T)=0 holds true, calculations are ended under the estimation that the presumed-value string is a digital data string in which the presumed value c_(temp) was stored. However, if Hc_(temp) ^(T)=0 does not hold true, then the variable node c_(i) recalculates the information q={q_(ij), q_(kj), . . . } and sends the calculation result to the check nodes {f_(j), f_(k), . . . } (see (b) in FIG. 5).

Herein, the information q_(ij) that is sent from the variable node c_(i) to the check node f_(j) represents “the probability at which the value of digital data of the variable node c_(i) is equal to 1”. That information is not included in the information r_(ji) received from the check node f_(j). That is, as a result of receiving the information q_(ij), the check node f_(j) receives information on the check nodes except for itself.

Upon receiving the information q, the check node calculates the probability r based on the received information q, and returns a variable node. This abovementioned algorithm is repeatedly implemented until the parity condition is satisfied. That is, the presumed-value string c_(temp) is updated using the calculated probability r; and, until Hc_(temp) ^(T)=0 holds true with respect to the updated presumed-value string c_(temp), the algorithm is repeatedly implemented.

Consider the case of Equation (2) given earlier. In Equation (2), a variable q_(kj) represents the provisional probability that provisionally indicates the probability at which the value of the variable node k is equal to “0”. A provisional probability p_(kj) at which the value of the variable node k is equal to “1” is provided by (1−q_(kj)). Thus, p_(kj)+q_(kj)=1 holds true. If that equation is substituted in Equation (2), Equation (3) given below is obtained.

$\begin{matrix} {r_{ji} = {\frac{1}{2} + {\frac{1}{2}{\prod\limits_{k \in {{A{(j)}} - {(i)}}}\left( {p_{jk} - q_{kj}} \right)}}}} & (3) \end{matrix}$

In Equation (3) given above, when the second term on the right-hand side is expanded, each term becomes equal to the product of the probability p and the probability q. Moreover, the term including an even number of probabilities q becomes a positive term, while the term including an odd number of probabilities q becomes a negative term. According to the definition, the probability q represents the probability at which the value of the original variable node is equal to “1”. Hence, when the number of included probabilities q is even, it indicates that an even number of “1” are included and that the parity is satisfied. In contrast, the term including an odd number of “1” corresponds to the case of violating the parity.

In the following explanation, for the sake of illustration, it is assumed that five variable nodes, namely, c_(i), c₁, c₂, c₃, and c₄ are connected to the check node f_(j). However, that is not the only possible example. That is, even if the variable nodes connected to a single check node are not five in number, the following explanation is applicable.

With the aim of avoiding complications, if the subscript “j” of the variables q_(kj) and p_(kj) is omitted, the second term on the right-hand side of Equation (3) can be expressed as Equation (4) given below.

$\begin{matrix} {{\prod\limits_{k \in {({1,2,3,4})}}\left( {p_{k} - q_{k}} \right)} = {{\left( {p_{1} - q_{1}} \right)\left( {p_{2} - q_{2}} \right)\left( {p_{3} - q_{3}} \right)\left( {p_{4} - q_{4}} \right)} = {{p_{1}p_{2}p_{3}p_{4}} + {p_{1}p_{2}q_{3}q_{4}} + {p_{1}q_{2}p_{3}q_{4}} + {p_{1}q_{2}q_{3}p_{4}} + {q_{1}p_{2}p_{3}q_{4}} + {q_{1}p_{2}q_{3}p_{4}} + {q_{1}q_{2}p_{3}p_{4}} + {q_{1}q_{2}q_{3}q_{4}} - {p_{1}p_{2}p_{3}q_{4}} - {p_{1}p_{2}q_{3}p_{4}} - {p_{1}q_{2}p_{3}p_{4}} - {q_{1}p_{2}p_{3}p_{4}} - {p_{1}q_{2}q_{3}q_{4}} - {q_{1}p_{2}q_{3}q_{4}} - {q_{1}q_{2}p_{3}q_{4}} - {q_{1}q_{2}q_{3}p_{4}}}}} & (4) \end{matrix}$

As is clear from Equation (4), the term including an even number of “p” becomes a positive term, and the term including an odd number of “p” becomes a negative term. Moreover, the probability r_(ji) represents the difference between the sum of probabilities of satisfying the parity condition and the sum of probabilities of parity violation. If the positive terms in the anterior half on the right-hand side of Equation (4) are written as (even 1, 2, 3, 4) and if the negative terms in the posterior half on the right-hand side of Equation (4) are written as (odd 1, 2, 3, 4), then (even 1, 2, 3, 4)+(odd 1, 2, 3, 4)=1 holds true. By taking that into account, Equation (3) can be expressed as Equation (5) given below.

$\begin{matrix} {r_{ji} = {{{\frac{1}{2}\left\{ {\left( {{{even}\mspace{14mu} 1},2,3,4} \right) + \left( {{{odd}\mspace{14mu} 1},2,3,4} \right)} \right\}} + {\frac{1}{2}\left\{ {\left( {{{even}\mspace{14mu} 1},2,3,4} \right) - \left( {{{odd}\mspace{14mu} 1},2,3,4} \right)} \right\}}} = \left( {{{even}\mspace{14mu} 1},2,3,4} \right)}} & (5) \end{matrix}$

As is clear from Equation (5), the probability r_(ji) represents the probability at which an even number of variable nodes having the value “1” are included among the variable nodes c₁, c₂, C₃, and c₄. That is, the probability r_(ji) represents the probability at which the variable node c_(i) should be equal to “0” as obtained from the information of the variable nodes c₁, c₂, c₃, and c₄. Meanwhile, the probability at which the variable node c_(i) should be equal to “1” is the probability (1−r_(ji)). Thus, the probability at which the currently-provided value of the variable node c_(i) should be reversed is: (the probability at which the variable node c_(i) should be equal to “0”)×(the probability at which the variable node c_(i) is currently equal to “1”)+(the probability at which the variable node c_(i) should be equal to “1”)×(the probability at which the variable node c_(i) is currently equal to “0”). That is expressed in Equation (6) given below.

$\begin{matrix} {{{p_{i}r_{ji}} + {q_{i}\left( {1 - r_{ji}} \right)}} = {{{p_{i}\left( {{{even}\mspace{14mu} 1},2,3,4} \right)} + {q_{i}\left( {{{odd}\mspace{14mu} 1},2,3,4} \right)}} = {{{\frac{1}{2}\left\{ {{p_{i}\left( {{{even}\mspace{14mu} 1},2,3,4} \right)} + {q_{i}\left( {{{odd}\mspace{14mu} 1},2,3,4} \right)} + {p_{i}\left( {{{odd}\mspace{14mu} 1},2,3,4} \right)} + {q_{i}\left( {{{even}\mspace{14mu} 1},2,3,4} \right)}} \right\}} + {\frac{1}{2}\left\{ {{p_{i}\left( {{{even}\mspace{14mu} 1},2,3,4} \right)} + {q_{i}\left( {{{odd}\mspace{14mu} 1},2,3,4} \right)} - {p_{i}\left( {{{odd}\mspace{14mu} 1},2,3,4} \right)} - {q_{i}\left( {{{even}\mspace{14mu} 1},2,3,4} \right)}} \right\}}} = {{\frac{1}{2} + {\frac{1}{2}\left( {p_{i} - q_{i}} \right)\left\{ {\left( {{{even}\mspace{14mu} 1},2,3,4} \right) - \left( {{{odd}\mspace{14mu} 1},2,3,4} \right)} \right\}}} = {\frac{1}{2} + {\frac{1}{2}\left( {p_{i} - q_{i}} \right)\left( {p_{1} - q_{1}} \right)\left( {p_{2} - q_{2}} \right)\left( {p_{3} - q_{3}} \right)\left( {p_{4} - q_{4}} \right)}}}}}} & (6) \end{matrix}$

If the second term of Equation (6) is expanded, it takes the form of (the sum of terms having an odd number of “p”)−(the sum of terms having an even number of “p”) in an identical manner to Equation (5) given earlier. Herein, it is assumed that the sum of terms having an odd number of “p” is written as (odd i, 1, 2, 3, 4) and the sum of terms having an odd number of “p” is written as (even i, 1, 2, 3, 4). If attention is given to the fact that (odd i, 1, 2, 3, 4)+(even i, 1, 2, 3, 4)=1 holds true, then Equation (6) is expressed as Equation (7) given below.

$\begin{matrix} {{\frac{1}{2} + {\frac{1}{2}\left\{ {\left( {{{odd}\mspace{14mu} i},1,2,3,4} \right) - \left( {{{even}\mspace{14mu} i},1,2,3,4} \right)} \right\}}} = {{{\frac{1}{2}\left\{ {\left( {{{odd}\mspace{14mu} i},1,2,3,4} \right) + \left( {{{even}\mspace{14mu} i},1,2,3,4} \right)} \right\}} + {\frac{1}{2}\left\{ {\left( {{{odd}\mspace{14mu} i},1,2,3,4} \right) - \left( {{{even}\mspace{14mu} i},1,2,3,4} \right)} \right\}}} = \left( {{{odd}\mspace{14mu} i},1,2,3,4} \right)}} & (7) \end{matrix}$

Since the sum (odd i, 1, 2, 3, 4) represents the sum of terms having an odd number of “p”, it is equal to the probability at which the set of values of the variable nodes c_(i), c₁, c₂, c₃, and c₄ violates the parity condition. Thus, in Equation (7), the check node f_(j) is determined to be incorrect with the probability at which the current value of the variable node c_(i) violates the parity condition, and is determined to be correct with the probability at which the current value of the variable node c_(i) satisfies the parity condition.

Since “the probability of satisfying the parity” and “the probability at which the current c_(i)=0 holds true” are known; “the probability at which c_(i)=0 should hold true” can be easily calculated from Equation (6) and Equation (7) given earlier.

In order to visually illustrate the check node processing explained above, a two-state trellis diagram is introduced as illustrated in FIG. 6. The two-state trellis diagram illustrated in FIG. 6 includes six nodes a₀ to a₅ arranged in the upper part and four nodes b₀ to b₄ arranged in the lower part. The upper part is referred to as a state A, and the lower part is referred to as a state B. Moreover, areas #1, #2, #i, #3, and #4 that are separated at the positions of the nodes a₀ to a₅ by vertical dashed lines correspond to the variable nodes c₁, c₂, c_(i), c₃, and c₄, respectively.

Herein, the sequence of the areas #1, #2, #i, #3, and #4 illustrated in FIG. 6 is not limited to this example. That is, any other sequence can also be used. For example, even if the area #i corresponding to the variable node c_(i) is present at the left end, it does not affect the final result.

Consider the discrete-time stochastic process from the node a₀ toward the node a₅. At the first step, transition occurs from the node a₀ to either the node a₁ or the node b₁. At that time, a probability q₁ represents the probability of transition from the node a₀ to the node a₁, while a probability p₁=1−q₁ represents the probability of transition from the node a₀ to the node b₁. If transition occurs from the node a₀ to node a₁; then, at the next step, transition occurs from the node a₁ to either the node a₂ or the node b₂. At that time, a probability q₂ represents the probability of transition from the node a₁ to the node a₂, while a probability p₂=1−q₂ represents the probability of transition from the node a₁ to the node b₂.

Herein, in the case in which sets of nodes (a_(x), b_(x)) and (a_(y), b_(y)) having an identical transition step are facing each other across an area z, transition occurring from the node a_(x) to the node a_(y) (transition occurring from the state A to the state A) as well as the probability of transition occurring from the node b_(x) to the node b_(y) (transition occurring from the state B to the state B) is assumed to have a probability q_(z). In an identical manner, transition occurring from the node a_(x) to the node b_(y) (transition occurring from the state A to the state B) as well as the probability of transition occurring from the node b_(x) to the node a_(y) (transition occurring from the state B to the state A) is assumed to have a probability p_(z). That is, with reference to FIG. 6, the probability q_(z) represents the probability of transition occurring in the horizontal direction, and the probability p_(z) represents the probability of transition occurring in an oblique direction.

In the two-state trellis diagram illustrated in FIG. 2, as a result of the stochastic process, paths from the node a₀ to the node a₅ are formed. In the example illustrated in FIG. 6, the node a₀ serves as the starting node and the node a₅ serves as the end node of the paths. In FIG. 7 is illustrated an exemplary path starting from the node a₀ to the node a₅. In the example illustrated in FIG. 7, transition occurs from the node a₀ to the node b₁ and from the node b₁ to the node b₂. Moreover, transition occurs from the node b₂ to the node a₃ and from the node a₃ to the node a₄. The probability at which the path illustrated in FIG. 7 is achieved is provided by a probability (p₁q₂p_(i)q₃q₄). When “p” is set to 1 and “q” is set to 0 as described above, the probability (p₁q₂p_(i)q₃q₄) corresponds to the variable nodes {c₁, c₂, c_(i), c₃, c₄}=(10100).

With reference to FIGS. 6 and 7, in the paths starting from the node a₀ to the node a₅; since the node a₀ as well as the node a₅ is in the state A, when a transition to the state B occurs once, there needs to be a return transition to the state A. That is, inter-state transition always occurs for an even number of times. In other words, in the equation of probability in the case of achieving a path from the starting node to the end node, the character “p” is certainly included for an even number of times. It corresponds to the fact that, in a variable node, “1” is included for an even number of times thereby satisfying the parity condition. As described above, since “the probability at which c_(i)=0 holds true” is known, “the probability at which c_(i)=0 should hold true” can be obtained with ease. In this way, the method of considering a path in a trellis diagram and calculating the probability along that path is called the BCJR algorithm (BCJR stands for Bahl, Cocke, Jelinek, and Raviv).

On the premise of the explanation given above, explanation of the embodiments is given below.

First Embodiment

Given below is the explanation of a first embodiment. In FIG. 8 is illustrated an exemplary configuration of a check node circuit according to the first embodiment. With reference to FIG. 8, the edges of the two-state trellis diagram illustrated in FIG. 6 are substituted with conducting wires, and switches 10 ₁₁ to 10 ₁₅, 10 ₂₁ to 10 ₂₄, 10 ₃₁ to 10 ₃₄, and 10 ₄₁ to 10 ₄₃ are arranged on the conducting wires. With that, a check node circuit 100 is configured. The following explanation is given as an example for a check node circuit that processes the probabilities received from five variable nodes. However, the variable nodes handled by the check node circuit can be greater or smaller in number than five.

Moreover, in the following explanation, regarding the switches 10 ₁₁ to 10 ₁₅, 10 ₂₁ to 10 ₂₄, 10 ₃₁ to 10 ₃₄, and 10 ₄₁ to 10 ₄₃; according to the function described later, the switches arranged on the conducting wires that connect nodes in the horizontal direction are expressed as Q_(y) ^(x) and the switches arranged on the conducting wires that connect nodes in an oblique direction are expressed as P_(y) ^(x). Herein, the subscript y represents an area in the two-state trellis diagram illustrated in FIG. 6. Regarding the superscript x, in the switches arranged on the conducting wires extending in the rightward direction (including the oblique directions) from the nodes in the state A (the nodes a₀ to a₃), the superscript x is written as “a”. Similarly, in the switches arranged on the conducting wires extending in the rightward direction (including the oblique directions) from the nodes in the state B (the nodes b₀ to b₄), the superscript x is written as “b”.

Thus, in the example illustrated in FIG. 8, the switches 10 ₁₁ to 10 ₁₅ to which the nodes a₀ to a₅ are sequentially connected are referred to as switches Q₁ ^(a), Q₂ ^(a), Q_(i) ^(a), Q₃ ^(a), and Q₄ ^(a). Similarly, the switches 10 ₄₁ to 10 ₄₃ to which the nodes b₁ to b₄ are sequentially connected are referred to as switches Q₂ ^(b), Q_(i) ^(b), and Q₃ ^(b). Moreover, in the rightward oblique direction from the nodes a₀ to a₃, the switches 10 ₂₁ to 10 ₂₄ arranged on the conducting wires connected to the nodes b₁ to b₄, respectively, are referred to as switches P₁ ^(a), P₂ ^(a), P_(i) ^(a), and P₃ ^(a). Furthermore, in the rightward oblique direction from the nodes b₁ to b₄, the switches 10 ₃₁ to 10 ₃₄ arranged on the conducting wires connected to the nodes a₂ to a₅, respectively, are referred to as switches P₂ ^(b), P_(i) ^(b), and P₃ ^(b), and P₄ ^(a).

Herein, it is desirable that the switches Q_(y) ^(a) and Q_(y) ^(b) perform exactly same operations. Similarly, it is desirable that the switches P_(y) ^(a) and P_(y) ^(b) perform exactly same operations. Moreover, it is desirable that the pair of switches Q_(y) ^(a) and Q_(y) ^(b) and the pair of switches P_(y) ^(a) and P_(y) ^(b) perform operations in a complementary manner. That is, when the switches Q_(y) ^(a) and Q_(y) ^(b) are in the open state, it is desirable that the switches P_(y) ^(a) and P_(y) ^(b) switch to the closed state. On the other hand, when the switches Q_(y) ^(a) and Q_(y) ^(b) are in the closed state, it is desirable that the switches P_(y) ^(a) and P_(y) ^(b) switch to the open state.

In the following explanation, in order to avoid complications, when the states A and B need not be particularly distinguished from each other, the switches Q_(y) ^(a) and Q_(y) ^(b) are collectively written as switches Q_(y) and the switches P_(y) ^(a) and P_(y) ^(b) are collectively written as switches P_(y).

The switches Q_(y) and P_(y) are configured to switch to the open state according to externally-set probabilities. Moreover, the switches Q_(y) and P_(y) perform operations in a complementary manner. Therefore, when the switches Q_(y) switch to the open state at a probability q_(y), the switches P_(y) switch to the open state at a probability (1−q_(y)).

With reference to FIG. 8, consider a case in which the switches Q₁ ^(a), Q₂ ^(a), Q₁ ^(a), Q₃ ^(a), and Q₄ ^(a); the switches P₁ ^(a), P₂ ^(a), P_(i) ^(a), and P₃ ^(a); the switches P₂ ^(b), P_(i) ^(b), P₃ ^(b), and P₄ ^(b); and the switches Q₂ ^(b), Q_(i) ^(b), and Q₃ ^(b) are simultaneously operated to create a path between the nodes a₀ and a₅. For example, to the node a₀ is connected a power supply; to the node a is connected a current detector; and it is determined whether or not a current pathway is formed between the nodes a₀ and a₅.

In FIG. 9 is illustrated an exemplary state during the operations of the switches. In (a) in FIG. 9, the switches illustrated with hatched lines represent the switches in the open state. Thus, in the example illustrated in (a) in FIG. 9, the switches Q₁ ^(a), Q_(i) ^(a), P₂ ^(a), P₃ ^(a), P₂ ^(b), P₃ ^(b), P₄ ^(b), and Q_(i) ^(b) are in the open state. The remaining switches are in the closed state.

In this case, as illustrated by heavy lines in (b) in FIG. 9, the following path is formed: the node a₀→the switch P₁ ^(a)→the node b₁→the switch Q₂ ^(b)→the node b₂→the switch P_(i) ^(b)→the node a₃→the switch Q₃ ^(a)→the node a₄→the switch Q₄ ^(a)→the node a₅. Thus, electrical current flows between the nodes a₀ and a₅. Other than this path, electrical current flows in no other path.

Herein, the probabilities at which the switches Q₁, Q₂, Q_(i), Q₃, and Q₄ switch to the open state are assumed to be identical to the probabilities q₁, q₂, q_(i), q₃, and q₄, respectively, at which the values of the variable nodes c₁, c₂, c_(i), c₃, and c₄ are equal to “0”. Consequently, the probability at which the current pathway illustrated with heavy lines in (b) in FIG. 9 is formed is provided by the probability (p₁q₂p_(i)q₃q₄).

Herein, the probability p_(k)=1−q_(k) holds true and represents the probability at which the switch P_(k) switches to the open state. This probability is equal to the probability at which the values of the variable nodes c₁, c₂, c_(i), c₃, and c₄ are equal to (c₁, c₂, c_(i), c₃, c₄)=(10100). In this way, the probability at which a particular path from the starting node a₀ to the end node a₅ is formed is equal to the probability at which a particular combination of the values of the variable nodes {c₁, c₂, c_(i), c₃, c₄} (in the example given above, “10100”) is achieved. This particular combination satisfies the parity condition without fail. That is because of the following reason. In order to start from the node a₀ and reach the node a₅, the switches P_(y) need to be passed for an even number of times. However, the probability at which the switches P_(y) switch to the open state is equal to the probability p_(y), that is, equal to the probability at which c_(y)=1 holds true.

Meanwhile, among the paths starting from the node a₀, there are paths that cannot reach the node a₅. Regarding that, the explanation is given with reference to FIG. 10. In (a) in FIG. 10, the switches Q₁ ^(a), Q₂ ^(a), Q_(i) ^(a), Q₂ ^(b), Q_(i) ^(b), P₃ ^(a), P₃ ^(b), P₄ ^(b) are in the open state. The remaining switches are in the closed state. In that case, the path that is formed is illustrated in (b) in FIG. 10. As illustrated in (b) in FIG. 10, in this example, the path starting from the node a₀ reaches the node b₄. However, since the switch P₄ ^(b) is in the open state, the path cannot reach the node a₅. The probability at which the path illustrated in (b) in FIG. 10 is formed is provided by a probability (p₁p₂p_(i)q₃a₄). This probability is equal to the probability at which the values (c₁, c₂, c_(i), c₃, c₄) of the variable nodes {c₁, c₂, c_(i), c₃, c₄} are equal to “11100”.

Thus, it can be understood that the probability (even 1, 2, i, 3, 4) at which the set {c₁, c₂, c_(i), c₃, c₄} of values of the variable nodes {c₁, C₂, c_(i), c₃, c₄}satisfies the parity condition is equal to the probability at which a path starting from the starting node a₀ to the end node a₅ is formed with reference to FIG. 8. Moreover, it can be understood that the probability (odd 1, 2, i, 3, 4) for parity violation is equal to the probability at which the path runs into a dead end at the node a₄ or the node b₄.

In that regard, consider a case in which the check node circuit 100 illustrated in FIG. 8 is operated for a number of times and, every time the check node circuit 100 is operated, the conduction between the nodes a₀ to a₅ is checked. Since the switches Q_(y) and P_(y) that are installed in the check node circuit 100 perform a probability-based switching operation, the states of the switches Q_(y) and P_(y) differ in every instance of operating the check node circuit 100. For that reason, the conduction between the nodes a₀ to a₅ also differs in every instance of operating the check node circuit 100. However, the probability of switching of the switches Q_(y) and P_(y) is constant. Hence, if switching of the switches Q_(y) and P_(y) in the check node circuit 100 is performed in a repeated manner, and if statistical processing is performed with respect to the conduction determination results; conduction is achieved at the probability for satisfying the parity condition but conduction is blocked at the probability for parity violation.

For example, consider a case in which the check node circuit 100 is made to perform a switching operation for 20 times with constant switching probabilities of the switches Q_(y) and P_(y), and conduction is achieved for eight times. In that case, the probability of satisfying the parity condition is 40%, and the probability of parity violation is 60%. Herein, since the probability at which the variable node c_(i) is currently equal to “0” is known, it is possible to obtain the probability at which c_(i)=0 should hold true. That is equivalent to a message from the check node f_(j) to the variable node c_(i), and the check node f_(j) transfers the result to the variable node c_(i). Then, the variable node c_(i) tallies the results received from the other check nodes, and updates the values of the probabilities q_(i) and p_(i).

In this way, in the first embodiment, the topology of the circuit that performs the check node processing during the decoding operation of an LDPC code is made compatible to a two-state trellis diagram that represents the algorithm of the check node processing. Then, the check node circuit 100 is configured by disposing, for each edge in the two-state trellis diagram, switches that perform a switching operation according to the set probability.

Meanwhile, in the explanation given above, although the same check node circuit 100 is operated in a repeated manner, that is not the only possible case. Alternatively, for example, a number of check node circuits 100 having an identical configuration can be installed, and the conduction probabilities can be obtained in parallel.

As described above, if the conduction is checked by repeatedly operating the check node circuit 100, which is illustrated in FIG. 8 and which includes the switches Q_(y) and P_(y) operating according to probabilities, or by installing a plurality of check node circuits 100 and operating them in parallel; it becomes possible to perform the check node processing with respect to the LDPC code.

In the following explanation, repeating the processing according to stochastic operations or performing a plurality of calculations in parallel according to stochastic operations is called sampling. The sampling count is equivalent to the accuracy of the probability value during calculations for decoding the LDPC code. In FIG. 11 are illustrated results of performing error correction of 981 bits using a 981×500 check matrix H. In each graph, the horizontal axis represents the repetition count of the decoding calculations, while the vertical axis represents the rate of error bits remaining in the code. In the code, errors have occurred due to AWGN (which stands for Additive White Gaussian Noise), and error correction capacity is verified for the SN ratios of 2.4 dB, 2.6 dB, 2.8 dB, 3.0 dB, 3.2 dB, and 3.4 dB with the sampling counts equal to 10 (a characteristic line 400), 20 (a characteristic line 401), 50 (a characteristic line 402), and 100 (a characteristic line 403). Moreover, a characteristic line 404 illustrated in FIG. 11 indicates the error correction result according to the normal LDPC decoding method, that is, according to the real number calculation.

As can be understood from the graphs illustrated in FIG. 11, when the sampling count is equal to 10, the error correction capacity is low. However, as the sampling count goes on increasing, the error correction capacity improves. Particularly, if the sampling count is 20 or more, it can be understood that the error correction capacity that compares favorably to the real number calculation can be achieved. In this way, if a simple circuit that operates according to probabilities is used in the check node processing with respect to the LDPC code, it becomes possible to perform error correction.

Meanwhile, as already described, it is desirable that the switches Q_(y) ^(a) and Q_(y) ^(b) perform exactly same operations, and the switches P_(y) ^(a) and P_(y) ^(b) perform exactly same operations. In that case, it is desirable that the pair of switches Q_(y) ^(a) and Q_(y) ^(b) and the pair of switches P_(y) ^(a) and P_(y) ^(b) perform operations in a complementary manner. Hence, as explained above, when both the switches Q_(y) ^(a) and Q_(y) ^(b) are in the open state, both the switches P_(y) ^(a) and P_(y) ^(b) switch to the closed state. On the other hand, when both the switches Q_(y) ^(a) and Q_(y) ^(b) are in the closed state, both the switches P_(y) ^(a) and P_(y) ^(b) switch to the open state. That is because, since a particular variable node c_(y) can take the value of either “1” or “0” in an exclusive manner, the switching operations are also provided with exclusiveness.

Meanwhile, if the exclusiveness among the switches Q_(y) and the switches P_(y) is ignored, there is a possibility that a plurality of paths connecting the nodes a₀ and a₅ are formed at the same time. In that case, the sum of probabilities in Equation (7) given above does not hold true anymore. However, that error is equal to about the probability at which two or more paths are formed at the same time, and can be considered to be an extremely small error. The essence of error correction using an LDPC code is stochastic inference, which has the merit of being tolerable to a certain amount of ambiguity.

In the case of the embodiments, the probability at which a plurality of paths is formed at the same time is smaller as compared to the value of each term in Equation (7). Thus, even if the operation such as “when both the switches Q_(y) ^(a) and Q_(y) ^(b) are in the open state, both the switches P_(y) ^(a) and P_(y) ^(b) switch to the closed state” is not performed, it becomes possible to perform error correction.

In this way, in the first embodiment, the topology of the circuit for performing the check node processing during the decoding operation of the LDPC code is made compatible to a two-state trellis diagram that represents the algorithm of the check node processing. Then, the check node circuit 100 is configured by installing, for each edge in the two-state trellis diagram, switches that perform a switching operation according to the set probability. For that reason, the check node processing during LDPC decoding can be implemented with a simple configuration.

Second Embodiment

Given below is the explanation of a second embodiment. In the second embodiment, the check node circuit 100 illustrated in FIG. 8 is configured using an MOS transistor (MOS stands for Metal-Oxide Semiconductor). In FIG. 12 is illustrated an example of a check node circuit 100 a according to the second embodiment. Meanwhile, in FIG. 12 as well as in the similar drawings referred hereinafter, the common portion with FIG. 8 is referred to by the same reference numerals, and the detailed explanation is not repeated.

With reference to FIG. 12, the switch units 10 ₁₁ to 10 ₁₅ and 10 ₄₁ to 10 ₄₃ that correspond to the switches Q_(y) as well as the switch units 10 ₂₁ to 10 ₂₄ and 10 ₃₁ to 10 ₃₄ that correspond to the switches P_(y) are configured using NMOS transistors (NMOS stands N-channel Metal Oxide Semiconductor) or PMOS transistors (PMOS stands for P-channel Metal Oxide Semiconductor). Although the switch units can be configured using either NMOS transistors or PMOS transistors, herein it is assumed that NMOS transistors are used.

Regarding each of the switch units 10 ₁₁ to 10 ₁₅, 10 ₂₁ to 10 ₂₄, 10 ₃₁ to 10 ₃₄, and 10 ₄₁ to 10 ₄₃; the source is connected to the nodes a₀ to a₅ and the drain is connected to the nodes b₁ to b₄, and switching between the source and the drain is controlled by a signal V input to the gate. In the example illustrated in FIG. 12, to the switch units 10 ₁₂ and 10 ₄₁ is input a signal V_(2q) of the probability q₂; and to the switch units 10 ₂₂ and 10 ₃₁ is input a signal V_(2p) of the probability p₂=1−q₂. Herein, a signal V_(j) of a probability q_(j) represents a digital signal that takes the value of either “1” or “0” according to the probability q_(j). Such a signal can be generated, for example, based on random numbers.

In an identical manner, to the switch units 10 ₁₃ and 10 ₄₂ is input a signal V_(iq) of the probability q_(i); and to the switch units 10 ₂₃ and 10 ₃₂ is input a signal V_(ip) of the probability p_(i)=1−q_(i). Moreover, to the switch units 10 ₁₄ and 10 ₄₃ is input a signal V_(3q) of the probability q₃; and to the switch units 10 ₂₄ and 10 ₃₃ is input a signal V_(3p) of the probability p₃=1−q₃. Meanwhile, to the switch unit 10 ₁₁ is input a signal V_(1q) of the probability q₁; and to the switch unit 10 ₂₁ is input a signal V_(1p) of the probability p₁=1−q₁. In an identical manner, to the switch unit 10 ₁₅ is input a signal V_(4q) of the probability q₄; and to the switch unit 10 ₃₄ is input a signal V_(4p) of the probability p₄.

In the check node circuit 100 a, for example, a current source 20 is connected to the starting node a₀, and a current detector 21 is connected to the end node a₅. Based on the detection result obtained by the current detector 21 according to the switching of the switch units 10 ₁₁ to 10 ₁₅, 10 ₂₁ to 10 ₂₄, 10 ₃₁ to 10 ₃₄, and 10 ₄₁ to 10 ₄₃; it becomes possible to determine whether or not a path is formed between the nodes a₀ to a₅. Regarding the determination result, either it is determined that a path is formed with the probability of satisfying the parity condition, or it is determined that a path is not formed with the probability of violating the parity condition.

In the check node circuit 100 a illustrated in FIG. 12, the switches Q_(y) and P_(y), which are operated in a complementary manner with respect to probabilities, can be configured using two different types of conductivity-type transistors. In the following explanation, the two different types of conductivity-type transistors are assumed to be NMOS transistors and PMOS transistor-transistors. In FIG. 13 is illustrated an example of a check node circuit 100 a′ in which the switches Q_(y), that is, the switch units 10 ₁₁ to 10 ₁₅ and 10 ₄₁ to 10 ₄₃ that are arranged on the conducting wires in the horizontal direction of the nodes in the two-state trellis diagram are configured with NMOS, transistors; while the switches P_(y), that is, the switch units 10 ₂₁ to 10 ₂₄ and 10 ₃₁ to 10 ₃₄ that are arranged on the conducting wires in an oblique direction are configured with PMOS transistors.

In contrast, in FIG. 14 is illustrated an example of a check node circuit 100 a″ in which the switches Q_(y), that is, the switch units 10 ₁₁ to 10 ₁₅ and 10 ₄₁ to 10 ₄₃ that are arranged on the conducting wires in the horizontal direction in the two-state trellis diagram are configured with PMOS transistors; while the switches P_(y), that is, the switch units 10 ₂₁ to 10 ₂₄ and 10 ₃₁ to 10 ₃₄ that are arranged on the conducting wires in an oblique direction are configured with NMOS transistors.

An NMOS transistor and a PMOS transistor perform complementary operations with respect to the same gate input. Hence, to the pair of switches Q_(y) and P_(y) that desirably perform complementary operations; for example, a signal V_(yq) can be commonly input so that a high state is achieved at the probability q_(y) and a low state is achieved at the probability p_(y)=1−q_(y). Of course, to the pair of switches Q_(y) and P_(y), a signal V_(yp) can also be commonly input so that a high state is achieved at the probability p_(y) and a low state is achieved at the probability q_(y)=1−p_(y).

In the example illustrated in FIG. 13, the signal V_(2q) of the probability q₂ is commonly input to the gates of the switch units 10 ₁₂, 10 ₂₂, 10 ₃₁, and 10 ₄₁. In an identical manner, the signal V_(iq) of the probability q_(i) is commonly input to the gates of the switch units 10 ₁₃, 10 ₂₃, 10 ₃₂, and 10 ₄₂. Moreover, the signal V_(3q) of the probability q₃ is commonly input to the gates of the switch units 10 ₁₄, 10 ₂₄, 10 ₃₃, and 10 ₄₃. Furthermore, the signal V_(1q) of the probability q₁ is commonly input to the gates of the switch units 10 ₁₁ and 10 ₂₁; and the signal V4 _(q) of the probability q₄ is commonly input to the gates of the switch units 10 ₁₅ and 10 ₃₄.

In the check node circuit 100 a″, which is illustrated in FIG. 14 and in which the NMOS transistors and the PMOS transistors are reversed as compared to the check node circuit 100 a′ illustrated in FIG. 13, the signals V₃, V₂, V₃, V₄ and V_(i) are respectively treated as signals V_(1p), V_(2p), V_(3p), V_(4p) and V_(ip) of the probabilities p₁, p₂, p₃, p₄ and p_(i), respectively, contrary to the case illustrated in FIG. 13.

In this way, in the second embodiment, the switches that are arranged on the edges of a two-state trellis diagram, which represents the check node processing during the decoding operation of an LDPC code, and that operate in a stochastic manner are configured using MOS transistors. For that reason, the check node processing during LDPC decoding can be implemented with a simple configuration.

Third Embodiment

Given below is the explanation of a third embodiment. In the third embodiment, the signals of the probabilities q_(y) and p_(y) are generated using resistance switch elements having two or more resistive states. In FIG. 15 is illustrated an exemplary configuration of a probability signal generator 30 in which a resistance switch element 300 is used. With reference to (a) in FIG. 15, the resistance switch element 300 is controlled to have the resistance value either in a high-resistance state or in a low-resistance state according to the setting done from outside. In the resistance switch element 300, one end is supplied with the signal V of a fixed voltage; and the other end is connected to the gate of a switch unit 10. Moreover, the resistance switch element 300 is, for example, grounded via a resistance 301 having a resistance value R₀.

In FIG. 16 is illustrated an exemplary configuration of a check node circuit 100 b in which the probability signal generators 30 are used. The check node circuit 100 b corresponds to the check node circuit 100 a explained with reference to FIG. 12. In the check node circuit 100 b, to the switch units. 10 ₁₂ and 10 ₄₁ is commonly connected a probability signal generator 30 ₁₂; and to the switch units 10 ₂₂ and 10 ₃₁ is commonly connected a probability signal generator 30 ₂₂. In an identical manner, to the switch units 10 ₁₃ and 10 ₄₂ is commonly connected a probability signal generator 30 ₁₃; and to the switch units 10 ₂₃ and 10 ₃₂ is commonly connected a probability signal generator 30 ₂₃. Moreover, to the switch units 10 ₁₄ and 10 ₄₃ is commonly connected a probability signal generator 30 ₁₄; and to the switch units 10 ₂₄ and 10 ₃₃ is commonly connected a probability signal generator 30 ₂₄. Furthermore, to the switch unit 10 ₁₁ is connected a probability signal generator 30 ₁₁; and to the switch unit 10 ₂₁ is connected a probability signal generator 30 ₂₁. In an identical manner, to the switch unit 10 ₁₅ is connected a probability signal generator 30 ₁₅; and to the switch unit 10 ₃₄ is connected a probability signal generator 30 ₂₅.

Given below is the detailed explanation of the operations performed by the resistance switch element 300. Herein, it is assumed that a resistance value R_(high) represents the resistance value in the high-resistance state of the resistance switch element 300; a resistance value R_(low) represents the resistance value in the low-resistance state of the resistance switch element 300; and R_(high)>>R₀>>R_(low) holds true. In the low-resistance state of the resistance switch element 300, R₀>>R_(low) holds true. Hence, the voltage V that is input from one end of the resistance switch element 300 gets applied without substantial modification to the gate of the switch unit 10. If the switch unit 10 is an NMOS transistor, it switches to the closed state. On the other hand, if the switch unit 10 is a PMOS transistor, it switches to the open state. Meanwhile, in the high-resistance state of the resistance switch element 300, R₀<<R_(high) holds true. Hence, the voltage V that is input from one end of the resistance switch element 300 becomes substantially equal to 0 V. In that case, if the switch unit 10 is an NMOS transistor, it switches to the open state. On the other hand, if the switch unit 10 is a PMOS transistor, it switches to the closed state.

As far as the resistance switch element 300 is concerned, a transition metal oxide such as TiO_(x), TaO_(x), HfO_(x), or WO_(x) is known; or a muitielemental oxide such as SrTiO₃ or Pr_(0.7)Ca_(0.3)MnO₃ is known; or a capacitor element is known in which a thin film of halogen, such as CaF₂ or BaF₂, is sandwiched between metal electrodes. In (b) in FIG. 15 is schematically illustrated a structure of the resistance switch element 300. Schematically, the structure of the resistance switch element 300 is such that an insulator thin film 311 is sandwiched between an upper electrode 310 and a lower electrode 312. The insulator thin film 311 has the film thickness of few nanometers to several tens of nanometers. However, that is not the only possible case. That is, the insulator thin film 311 can have a smaller film thickness or a greater film thickness.

The resistance switch element 300 has the characteristic that the deficient oxygen or the deficient halogen that is present inside moves due to voltage, and there is an exponential change in the resistance to the application of voltage. For example, in the case in which the insulator thin film 311 in the resistance switch element 300 is made of a metal oxide, if a positive voltage is applied to the upper electrode 310, the deficient oxygen present inside moves away from the boundary face of the upper electrode 310 thereby leading to the transition from the low-resistance state to the high-resistance state. On the other hand, if a negative voltage is applied to the upper electrode 310, the deficient oxygen gathers at the boundary face of the upper electrode 310 thereby leading to the transition from the high-resistance state to the low-resistance state. This phenomenon is called a bipolar resistance switching phenomenon.

In FIG. 17 is illustrated an example of the current-voltage characteristic of the bipolar resistance switching phenomenon occurring due to TaO_(x). In (a) and (b) in FIG. 17, the left end indicates the transition from the high-resistance state to the low-resistance state; and the right end indicates the transition from the low-resistance state to the high-resistance state. In the bipolar resistance switching phenomenon attributed to the deficient oxygen, it is possible to achieve a resistance ratio of 100 times or more between the high-resistance state and the low-resistance state. Thus, the abovementioned condition of R_(high)>>R₀>>R_(low) can be satisfied.

Meanwhile, as the resistance switch element 300, it is also possible to use a capacitor element, which has a structure in which a sulfide or a selenide such as silver sulfide, copper sulfide, germanium sulfide, or germanium selenide; or an amorphous semiconductor such as amorphous silicon; or a metallic ion conductor of an oxidative product such as SiO₂ or TaO_(x) is sandwiched between the upper electrode 310, which is made of Ag, Cu, or Ni that is easily ionizable, and the lower electrode 312 made or Pt, Ta, W, or Ir that is difficult to ionize. In the case of a capacitor element, the thickness of the metallic ion conductor is, for example, between few nanometers to several tens of nanometers. However, the thickness can be greater or smaller than that.

Regarding the capacitor-type resistance switch element 300, in the structure illustrated in (b) in FIG. 15, a metallic ion conductor is used in place of the insulator thin film 311. Then, the ions of the upper electrode 310 enter the metal ion conductor. Due to the application of voltage, the metallic ions move thereby leading to an exponential change in the resistance value. For example, when a positive voltage is applied to the upper electrode 310 that is made of an easily-ionizable metal; the metallic ions flow from the upper electrode 310 to the metallic ion conductor thereby leading to the formation of a conduction path, and the resistance switch element 300 switches from the high-resistance state to the low-resistance state. On the other hand, when a negative voltage is applied to the upper electrode 310; the metallic ions that were forming the conduction path return to the upper electrode 310. Therefore, the resistance switch element 300 switches from the low-resistance state to the high-resistance state. In the resistance switch element 300 in which a capacitor element is used, it is possible to achieve a resistance ratio of 1000 times or more between the high-resistance state and the low-resistance state. Thus, the abovementioned condition of R_(high)>>R₀>>R_(low) can be satisfied.

The common aspect in such resistance switch elements 300 is that a deficiency or ions move inside the insulator and the resistance undergoes transition. As compared to electrons, a deficiency or ions move in an extremely large and hopping manner in the grid of the insulator. That collective behavior becomes a stochastic behavior. For that reason, even in the case in which the voltage is repeatedly applied under the same condition to the resistance switch element 300 in the high-resistance state, the transition to the low-resistance state does not occur except in a stochastic manner.

In FIG. 18 is illustrated an exemplary relationship between the switching period and the cumulative probability of the resistance switch element 300 in which TaO_(x) is used. That is, in FIG. 18 is illustrated a cumulative probability distribution of the period of time (the switching period) taken in the resistance switch element 300, in which TaO_(x) is used, since the application of a fixed voltage in the high-resistance state up to transition to the low-resistance state. As can be understood from FIG. 18, the switching period is distributed across about triple digits, and it is indicated that the transition itself is stochastic. If the state of the resistance switch element 300 is to be switched at the rate of 20%, it can be understood from FIG. 18 that the voltage can be applied for 400 nanoseconds. That is, in FIG. 18, it takes 400 nanoseconds for the cumulative probability to reach 0.2.

In this way, using the resistance switch element 300 in which the cumulative probability changes according to the switching period, the probability signal generator 30 as illustrated in (a) in FIG. 15 is configured. To both ends of the resistance switch element 300, a voltage is applied only for a period of time in which a desired probability is achieved, and the resistance switch element 300 is set to a low resistance at a desired probability. Then, to one end of the resistance switch element 300 (to the end not connected to the switch unit 10), a gate signal for the switch unit 10 is input. As a result, the switch unit 10 can be switched to the open state at a desired probability.

As a result of using this type of resistance switch element 300, as illustrated in FIG. 16, the check node processing during LDPC decoding can be implemented with a simple configuration.

With reference to FIG. 16, to each of the probability signal generators 30 ₁₁ to 30 ₁₅ and 30 ₂₁ to 30 ₂₅, the signal V of a fixed voltage is input; and each resistance switch element 300 is controlled according to the probabilities q₁, q₂, q_(i), q₃, and q₄ as well as according to the probabilities p₁, p₂, p_(i), p₃, and p₄.

In FIGS. 19 and 20 are illustrated configurations corresponding to the configurations illustrated in FIGS. 13 and 14, respectively. That is, in FIG. 19 is illustrated an example of a check node circuit 100 b′ in which, in contrast to the configuration illustrated in FIG. 16, the switch units 10 ₁₁ to 10 ₁₅ and 10 ₄₁ to 10 ₄₃ that are arranged on the conducting wires in the horizontal direction of the nodes in the two-state trellis diagram are configured with NMOS transistors; and the switch units 10 ₂₁ to 10 ₂₄ and 10 ₃₁ to 10 ₃₄ that are arranged on the conducting wires in an oblique direction are configured with PMOS transistors. In this example, to the switch units 10 ₁₁ and 10 ₂₁ is commonly connected a probability signal generator 30 ₁; and to the switch units 10 ₁₅ and 10 ₃₄ is commonly connected a probability signal generator 30 ₅. Moreover, to the switch units 10 ₁₂, 10 ₂₂, 10 ₃₁, and 10 ₄₁ is commonly connected a probability signal generator 30 ₂; to the switch units 10 ₁₃, 10 ₂₃, 10 ₃₂, and 10 ₄₂ is commonly connected a probability signal generator 30 ₃; and to the switch units 10 ₁₄, 10 ₂₄, 10 ₃₃, and 10 ₄₃ is commonly connected a probability signal generator 30 ₄.

In this configuration, in the check node circuit 100 b′, the signal V of a fixed voltage is input to the probability signal generators 30 ₁ to 30 ₅; and the respective resistance switch elements 300 are controlled according to the probabilities q₁, q₂, q_(i), q₃, and q₄.

In FIG. 20 is illustrated an example of a check node circuit 100 b″ in which the NMOS transistors and the PMOS transistors in the switch units 10 are reversed as compared to the configuration illustrated in FIG. 19. In the check node circuit 100 b″, the connections of the probability signal generators 30 ₁ to 30 ₅ are substantially identical to the check node circuit 100 b′ illustrated in FIG. 19. Hence, the explanation is not repeated. However, in the check node circuit 100 b″, the resistance switch elements 300 corresponding to the probability signal generators 30 ₁ to 30 ₅ are controlled according to the probabilities p₁, p₂, p_(i), p₃, and p₄.

First Modification Example of Third Embodiment

Given below is the explanation of a first modification example of the third embodiment. It is desirable that the voltage applied to both ends of the resistance switch element 300 for the purpose of switching the resistance switch element 300 from the high-resistance state to the low-resistance state is higher than the voltage applied for the transistor operation in the switch units 10. That is because, if the resistance switch element 300 operates during the transistor operation, there is a possibility that switching of the transistors does not occur at the desired probability. On the other hand, if the voltage applied to both ends of the resistance switch element 300 is too high, then there is a risk of destroying the transistors of the switch units 10.

In that regard, in the first modification example of the third embodiment, as illustrated in FIG. 21, a probability signal generator 31 is configured by, for example, grounding the connection point of the resistance switch element 300 and the switch unit 10 via a switch element 302. The switch element 302 is controlled to switch to the open state only when the resistance switch element 300 is to be switched to the low-resistance state. As a result, it can be ensured that the voltage applied to the gate of the switch unit 10 does not become too high.

In FIG. 22 is illustrated an example of a check node circuit 100 c in which the probability signal generator 31 according to the first modification example of the third embodiment is used. Thus, the check node circuit 100 c is configured by substituting the probability signal generators 30 ₁₁ to 30 ₁₅ and 30 ₂₁ to 30 ₂₅ of the check node circuit 100 b illustrated in FIG. 16 according to the third embodiment with probability signal generators 31 ₁₁ to 31 ₁₅ and 31 ₂₁ to 31 ₂₅ according to the first modification example of the third embodiment.

In FIG. 23 is illustrated an example of a check node circuit 100 c′ in which the probability signal generators 31 are used with respect to a configuration in which the gate signals are standardized using NMOS transistors and PMOS transistors as the transistors of the switch units 10. In the example illustrated in FIG. 23, the check node circuit 100 c′ is configured by substituting the probability signal generators 30 ₁ to 30 ₅ of the check node circuit 100 b′ illustrated in FIG. 19 with probability signal generators 31 ₁ to 31 ₅ according to the first modification example of the third embodiment. Of course, that is not the only possible case. Alternatively, in the configuration illustrated in FIG. 23, NMOS transistors and PMOS transistors can be interchanged too.

In this way, even when the probability signal generators 31 according to the first modification example of the third embodiment are used, the check node processing during LDPC decoding can be implemented with a simple configuration.

Second Modification Example of Third Embodiment

Given below is the explanation of a second modification example of the third embodiment. According to the second modification example, in the probability signal generators 31, the switch element 302 is replaced with a threshold-switch-type selector. In FIG. 24A is illustrated an exemplary configuration of a probability signal generator 32 according to the second modification example of the third embodiment. The connection point between the resistance switch element 300 and the switch unit 10 is, for example, grounded via a selector 303.

The threshold-switch-type selector 303 can be implemented using a capacitor made of a laminated film of a metal oxide such as Pt/TaO_(x)/TiO₂/TaO_(x)/Pt. In FIG. 25 is illustrated a characteristic example of the threshold-switch-type selector 303. As illustrated by a characteristic line 330 in FIG. 25, the selector 303 exhibits a strong non-linear characteristic at low voltages. Hence, there is almost no flow of current. When the voltage exceeds the threshold voltage, the current starts flowing rapidly. Thus, the design is done in such a way that the voltage for switching to the low-resistance state is higher than the threshold voltage, and the operating voltage of the transistors of the switch units 10 is lower than the threshold voltage. As a result, it can be ensured that the gates of the switch units 10 are grounded at the time of switching to the low-resistance state, and that a voltage is applied to the gates only during the operations of the transistors of the switch units 10.

As another example of the second modification example of the third embodiment, as illustrated in a probability signal generator 32′ in FIG. 24B, the selector 303 can be configured also by parallely connecting diodes 320 a and 320 b in mutually opposite directions. That is, the parallel connection of the diodes 320 a and 320 b also exhibits the characteristic as illustrated by the characteristic line 330 in FIG. 25. As the diodes 320 a and 320 b, it is possible to use PN-junction diodes or Schotky diodes.

In FIG. 26 is illustrated an example of a check node circuit 100 d in which the probability signal generators 32, which are configured using the threshold-switch-type selector 303, are used according to the second modification example of the third embodiment. The check node circuit 100 d is configured by substituting the probability signal generators 30 ₁₁ to 30 ₁₅ and 30 ₂₁ to 30 ₂₅ of the check node circuit 100 b illustrated in FIG. 16 according to the third embodiment with probability signal generators 32 ₁₁ to 32 ₁₅ and 32 ₂₁ to 32 ₂₅ according to the second modification example of the third embodiment.

In FIG. 27 is illustrated an example of a check node circuit 100 d′ in which the probability signal generators 32 are used with respect to a configuration in which the gate signals are standardized using NMOS transistors and PMOS transistors as the transistors of the switch units 10. In the example illustrated in FIG. 27, the check node circuit 100 d′ is configured by substituting the probability signal generators 30 ₁ to 30 ₅ of the check node circuit 100 b′ illustrated in FIG. 19 with probability signal generators 32 ₁ to 32 ₅ according to the second modification example of the third embodiment. Of course, that is not the only possible case. Alternatively, in the configuration illustrated in FIG. 27, NMOS transistors and PMOS transistors can be interchanged too.

In FIG. 28 is illustrated an example of a check node circuit 100 e configured using the probability signal generators 32′ that include the selector 303 having parallel connection of the diodes 320 a and 320 b. The check node circuit 100 e is configured by substituting the probability signal generators 30 ₁₁ to 30 ₁₅ and 30 ₂₁ to 30 ₂₅ of the check node circuit 100 b illustrated in FIG. 16 according to the third embodiment with probability signal generators 32 ₁₁′ to 32 ₁₅′ and 32 ₂₁′ to 32 ₂₅′ according to the second modification example of the third embodiment.

In FIG. 29 is illustrated an example of a check node circuit 100 e′ in which the probability signal generators 32′ are used with respect to a configuration in which the gate signals are standardized using NMOS transistors and PMOS transistors as the transistors of the switch units 10. In the example illustrated in FIG. 29, the check node circuit 100 e′ is configured by substituting the probability signal generators 30 ₁ to 30 ₅ of the check node circuit 100 b′ illustrated in FIG. 19 with the probability signal generators 32 _(t)′ to 32 ₅′ according to the second modification example of the third embodiment. Of course, that is not the only possible case. Alternatively, in the configuration illustrated in FIG. 29, NMOS transistors and PMOS transistors can be interchanged too.

In this way, even when the probability signal generators 32 or the probability signal generators 32′ according to the second modification example of the third embodiment are used, the check node processing during LDPC decoding can be implemented with a simple configuration.

Third Modification of Third Embodiment

Given below is the explanation of a third modification example of the third embodiment. In the third modification example, as illustrated in FIG. 30, a probability signal generator 33 is configured using a charge-accumulating-type variable threshold transistor 304 in place of the resistance switch element 300. With reference to FIG. 30, the probability signal generator 33 is configured in which the source of the charge-accumulating-type variable threshold transistor 304 is supplied with the signal V of a predetermined voltage; the drain of the charge-accumulating-type variable threshold transistor 304 is connected to the gate of the switch unit 10; and the charge-accumulating-type variable threshold transistor 304 is, for example, grounded via the resistance 301 having the resistance value R₀.

The charge-accumulating-type variable threshold transistor 304 can store electrical charge inside gate electrodes, and the threshold value changes according to the accumulated electrical charge. The storage of electrical charge in the charge-accumulating-type variable threshold transistor 304 is done using the tunnel effect and injecting electrical charge in the charge storing portion via an insulator film. The tunnel effect is a quantum-mechanical effect occurring as a stochastic phenomenon. Thus, even if electrical charge is injected using the same voltage, the injected quantity of electrical charge varies in a stochastic manner, thereby leading to variability in the threshold value too. The distribution of such variability changes according to the manner of applying the voltage while injecting electrical charge. In other words, the rate, that is, the probability at which the threshold value exceeds a certain value can be controlled according to the manner of applying the voltage while injecting electrical charge in the charge-accumulating-type variable threshold transistor 304.

In that regard, for example, it is assumed that, when injection of electrical charge to the charge-accumulating-type variable threshold transistor 304 illustrated in FIG. 30 is done using an appropriate voltage, the rate at which the threshold value exceeds a certain value is 40%. When the voltage of the certain value is applied to the gate of the charge-accumulating-type variable threshold transistor 304, there is a probability of 40% at which the charge-accumulating-type variable threshold transistor 304 switches to the open state. In that state, if the signal V is input from the source of the charge-accumulating-type variable threshold transistor 304, then there is a probability of 40% at which the signal V reaches the switch unit 10 that is connected to the drain. Thus, when the switch unit 10 has an N-type transistor, there is a probability of 40% at which the switch unit 10 switches to the open state. Meanwhile, if an identical voltage is applied to the gate, then there is a probability of 60% at which the charge-accumulating-type variable threshold transistor 304 switches to the open state. In that case, the gate of the transistor of the switch unit 10 gets grounded via the resistance 301. Of course, if the switch unit 10 has a P-type transistor, there is a possibility of 60% at which the switch unit 10 switches to the closed state.

In FIG. 31 is illustrated an example of a check node circuit 100 f according to the third modification example of the third embodiment and in which the probability signal generator 33 having the charge-accumulating-type variable threshold transistor 304 is used. The check node circuit 100 f is configured by substituting the probability signal generators 30 ₁₁ to 30 ₁₅ and 30 ₂₃ to 30 ₂₅ of the check node circuit 100 b illustrated in FIG. 16 according to the third embodiment with probability signal generators 33 ₁₁ to 33 ₁₅ and 33 ₂₁ to 33 ₂₅ according to the third modification example of the third embodiment.

In FIG. 32 is illustrated an example of a check node circuit 100 f′ in which the probability signal generators 33 are used with respect to a configuration in which the gate signals are standardized using NMOS transistors and PMOS transistors as the transistors of the switch units 10. In the example illustrated in FIG. 32, the check node circuit 100 f′ is configured by substituting the probability signal generators 30 ₁ to 30 ₅ of the check node circuit 100 b′ illustrated in FIG. 19 with probability signal generators 33 ₁ to 33 ₅ according to the third modification example of the third embodiment. Of course, that is not the only possible case. Alternatively, in the configuration illustrated in FIG. 32, NMOS transistors and PMOS transistors can be interchanged too.

In this way, even when the probability signal generators 33 according to the third modification example of the third embodiment are used, the check node processing during LDPC decoding can be implemented with a simple configuration.

Fourth Embodiment

Given below is the explanation of a fourth embodiment. In the fourth embodiment, signals having complementary probabilities are generated using an inverter circuit, and the gate signals are standardized. In FIG. 33 is illustrated an exemplary configuration of a check node circuit 100 g ₁ according to the fourth embodiment. With reference to FIG. 33, the check node circuit 100 g ₁ is configured using NMOS transistors in all switch units 10; and, in each pair of switch units 10 that should complement each other, the gate of one of the switch units 10 has an inverter circuit 34 connected thereto.

More particularly, the signal V_(1q) of the probability q₁ is input to the gate of the switch unit 10 ₁₁ and is input to the gate of the switch unit 10 ₂₁ via an inverter circuit 34 ₁. Moreover, the signal V_(2q) of the probability q₂ is input to the gates of the switch units 10 ₁₂ and 10 ₄₁ and is input to the gates of the switch units 10 ₂₂ and 10 ₃₁ via an inverter circuit 34 ₂. In an identical manner, the signal V_(iq) of the probability q_(i) is input to the gates of the switch units 10 ₁₃ and 10 ₄₂ and is input to the gates of the switch units 10 ₂₃ and 10 ₃₂ via an inverter circuit 34 ₃. Moreover, the signal V_(3q) of the probability q₃ is input to the gates of the switch units 10 ₁₄ and 10 ₄₃ and is input to the gates of the switch units 10 ₂₄ and 10 ₃₃ via an inverter circuit 34 ₄. Meanwhile, the signal V_(4q) of the probability q₄ is input to the gate of the switch unit 10 ₁₅ and is input to the gate of the switch unit 10 ₃₄ via an inverter circuit 34 ₅.

In such a configuration, for example, with respect to the signal V_(2q), the switch units 10 ₁₂ and 10 ₄₁ perform switching in a complementary manner to the switch units 10 ₂₂ and 10 ₃₁. The same is the case regarding the other signals V_(1q), V_(iq), V_(3q), and V_(4q) too.

Moreover, the same is the case even if the signals V_(1q), V_(2q), V_(iq), V_(3q), and V_(4q) too are replaced with the signals V_(1p), V_(2p), V_(iq), V_(3q), and V_(4q) of the probability p_(y)=1−q_(y). Meanwhile, in the example illustrated in FIG. 33, the inverter circuits 34 ₁ to 34 ₅ are connected to the gates of the switch units 10 ₂₁ to 10 ₂₄ and 10 ₃₁ to 10 ₃₄ that are arranged on the conducting wires connecting nodes in an oblique direction in a two-state trellis diagram. However, that is not the only possible case. Alternatively, the inverter circuits 34 ₁ to 34 ₅ can be connected to the gates of the switch units 10 ₁₁ to 10 ₁₅ and 10 ₄₁ to 10 ₄₃ that are arranged on the conducting wires connecting nodes in the horizontal direction in a two-state trellis diagram.

In this way, even in the case in which signals having complementary probabilities are generated using inverter circuits according to the fourth embodiment, the check node processing during LDPC decoding can be implemented with a simple configuration.

Modification Examples of Fourth Embodiment

Given below is the explanation of a modification example of the fourth embodiment. The configuration for generating signals having complementary probabilities using inverter circuits according to the fourth embodiment can be implemented in the configurations according to the third embodiment and the modification examples of the third embodiment for generating signals having complementary probabilities using NMOS transistors and PMOS transistors as the switch units 10.

In FIG. 34 is illustrated an example of a check node circuit 100 g ₂ according to a first example of the modification example of the fourth embodiment. The check node circuit 100 g ₂ illustrated in FIG. 34 is an example in which the inverter circuits 34 ₁ to 34 ₅ are implemented in the check node circuit 100 b′ that is configured with the probability signal generators 30 ₁ to 30 ₅ including the resistance switch element 300 as illustrated in FIG. 19 according to the third embodiment. In FIG. 35 is illustrated an example of a check node circuit 100 g ₃ according to a second example of the modification example of the fourth embodiment. The check node circuit 100 g ₃ illustrated in FIG. 35 is an example in which the inverter circuits 34 ₁ to 34 ₅ are implemented in the check node circuit 100 c′ that is configured with the probability signal generators 31 ₁ to 31 ₅ as illustrated in FIG. 23 according to the first modification example of the third embodiment. In FIG. 36 is illustrated an example of a check node circuit 100 g ₄ according to a third example of the modification example of the fourth embodiment. The check node circuit 1009 g ₄ illustrated in FIG. 36 is an example in which the inverter circuits 34 ₁ to 34 ₅ are implemented in the check node circuit 100 d′ that is configured with the probability signal generators 32 ₁ to 32 ₅ as illustrated in FIG. 27 according to the second modification example of the third embodiment. In FIG. 37 is illustrated an example of a check node circuit 100 g ₅ according to a fourth example of the modification example of the fourth embodiment. The check node circuit 100 g ₅ illustrated in FIG. 37 is an example in which the inverter circuits 34 ₁ to 34 ₅ are implemented in the check node circuit 100 e′ that is configured with the probability signal generators 32 ₁′ to 32 ₅′ as illustrated in FIG. 29 according to the second modification example of the third embodiment. Moreover, the inverter circuits 34 ₁ to 34 ₅ can also be implemented in the check node circuit 100 f′ that is configured with the probability signal generators 33 ₁ to 33 ₅ according to the third modification example of the third embodiment.

In each of the configurations illustrated in FIGS. 34 to 37, the inverter circuits 34 ₁ to 34 ₅ are connected to the gates of the switch units 10 ₂₁ to 10 ₂₄ and 10 ₃₁ to 10 ₃₄ that are arranged on the conducting wires connecting nodes in an oblique direction in a two-state trellis diagram.

In this way, even in the case in which signals having complementary probabilities are generated using inverter circuits in a configuration for generating signals according to the probabilities using the resistance switch element 300 or the charge-accumulating-type variable threshold transistor 304, the check node processing during LDPC decoding can be implemented with a simple configuration.

Fifth Embodiment

Given below is the explanation of a fifth embodiment. The embodiments and the modification examples described above are implemented in the decoder 4 of the memory system 1 illustrated in FIG. 1. However, that is not the only possible case. That is, the embodiments and the modification examples described above can also be implemented in a communication system that sends and receives data through wired communication paths or wireless communication paths.

In FIG. 38 is illustrated an example of a communication system that can be implemented in the fifth embodiment. With reference to FIG. 38, input data 5′ is input to an encoder 3′. Then, the encoder 3′ encodes the input data 5′ into an LDPC code. A modulator 7 modulates the LDPC code in the encoded form according to a method suitable for a communication path 8, and sends the modulated code as a modulation signal to the communication path 8. A demodulator 9 receives the modulation signal sent through the communication path 8, demodulates the modulation signal as digital data, and sends the digital data to the decoder 4′. At that time, the demodulator 9 sends information related to the received signal to the decoder 4′. Based on the information related to the received signal as sent by the demodulator 9, the decoder 4′ obtains the bit-by-bit probability value of the digital data sent by the demodulator 9. Then, based on the obtained probability values, the decoder 4′ decodes the LDPC code in the manner described in the first to fourth embodiments and the modification examples thereof, and restores the input data 5′. Subsequently, the decoder 4′ outputs the restored data as output data 6′.

In this way, also in a communication system for sending and receiving information via the communication path 8, the check node processing during LDPC decoding can be implemented with a simple configuration.

While certain embodiments have been described, these embodiments have been presented by way of example only, and are not intended to limit the scope of the inventions. Indeed, the novel embodiments described herein may be embodied in a variety of other forms; furthermore, various omissions, substitutions and changes in the form of the embodiments described herein may be made without departing from the spirit of the inventions. The accompanying claims and their equivalents are intended to cover such forms or modifications as would fall within the scope and spirit of the inventions. 

What is claimed is:
 1. A decoding device comprising: a probability acquirer configured to acquire a probability value for each bit of encoded data received; a check node processor configured to perform check node processing during in a decoding operation of the encoded data, the probability values being treated as initial variable nodes in the check node processing; and a converter configured to convert, into bit values, updated values of the probability values which are updated based on a result of the check node processing, wherein the check node processor includes a check node circuit having a topology corresponding to a two-state trellis diagram representing the check node processing, the check node circuit includes conducting wires each corresponding to an edge of the two-state trellis diagram and includes switch units which are arranged on the conducting wires and switching of which is controlled according to a predetermined probability, and based on presence or absence of conduction between a first terminal in the check node circuit corresponding to a starting node of the two-state trellis diagram and a second terminal in the check node circuit corresponding to an end node of the two-state trellis diagram, the check node processor performs check node processing with respect to the variable nodes corresponding to the check node circuit.
 2. The decoding device according to claim 1, wherein from among the switch units that are arranged on the conducting wires corresponding to the edges for identical of the variable nodes, the check node processor performs complementary operation between first switch units that are arranged on the conducting wires corresponding to the edges connecting identical states in the two-state trellis diagram, and second switch units that are arranged on the conducting wires corresponding to the edges connecting different states in the two-state trellis diagram.
 3. The decoding device according to claim 2, wherein each of the first switch units is made up of a first conductivity-type MOS transistor, and each of the second switch units is made up of a second conductivity-type MOS transistor.
 4. The decoding device according to claim 3, wherein the gate of the corresponding MOS transistor in the first switch units and the second switch units is connected to a resistive element.
 5. The decoding device according to claim 3, wherein the gate of the corresponding MOS transistor in the first switch units and the second switch units is connected to a charge-accumulating-type variable threshold transistor.
 6. The decoding device according to claim 1, wherein each of the switch units includes a MOS transistor whose gate receives a control signal according to the predetermined probability.
 7. The decoding device according to claim 6, wherein the gate of the MOS transistor in each of the switch units is connected to a resistive element.
 8. The decoding device according to claim 6, wherein the gate of the MOS transistor in each of the switch units is connected to a charge-accumulating-type variable threshold transistor.
 9. A decoding method comprising: acquiring a probability value for each bit of encoded data received; performing check node processing during in a decoding operation of the encoded data, the probability values being treated as initial variable nodes in the check node processing; and converting, into bit values, updated values of the probability values which are updated based on a result of the check node processing, wherein the check node processing includes performing check node processing with respect to the variable nodes corresponding to a check node circuit having a topology corresponding to a two-state trellis diagram representing the check node processing, using conducting wires and switch units of the check node circuit, the conducting wires each corresponding to an edge of the two-state trellis diagram, the switch units being arranged on the conducting wires, switching of the switch units being controlled according to a predetermined probability, based on presence or absence of conduction between a first terminal in the check node circuit corresponding to a starting node of the two-state trellis diagram and a second terminal in the check node circuit corresponding to an end node of the two-state trellis diagram.
 10. A memory system comprising: an encoder configured to encode input data and generate encoded data; a nonvolatile memory used in storing the encoded data; and a decoder configured to decode the encoded data which is read from the memory, wherein the decoder includes a probability acquirer configured to acquire a probability value for each bit of encoded data received; a check node processor configured to perform check node processing during in a decoding operation of the encoded data, the probability values being treated as initial variable nodes in the check node processing; and a converter configured to convert, into bit values, updated values of the probability values which are updated based on a result of the check node processing, wherein the check node processor includes a check node circuit having a topology corresponding to a two-state trellis diagram representing the check node processing, the check node circuit includes conducting wires each corresponding to an edge of the two-state trellis diagram and includes switch units which are arranged on the conducting wires and switching of which is controlled according to a predetermined probability, and based on presence or absence of conduction between a first terminal in the check node circuit corresponding to a starting node of the two-state trellis diagram and a second terminal in the check node circuit corresponding to an end node of the two-state trellis diagram, the check node processor performs check node processing with respect to the variable nodes corresponding to the check node circuit.
 11. The memory system according to claim 10, wherein from among the switch units that are arranged on the conducting wires corresponding to the edges for identical of the variable nodes, the check node processor performs complementary operation between first switch units that are arranged on the conducting wires corresponding to the edges connecting identical states in the two-state trellis diagram, and second switch units that are arranged on the conducting wires corresponding to the edges connecting different states in the two-state trellis diagram.
 12. The memory system according to claim 11, wherein each of the first switch units is made up of a first conductivity-type MOS transistor, and each of the second switch units is made up of a second conductivity-type MOS transistor.
 13. The memory system according to claim 12, wherein the gate of the corresponding MOS transistor in the first switch units and the second switch units is connected to a resistive element.
 14. The memory system according to claim 12, wherein the gate of the corresponding MOS transistor in the first switch units and the second switch units is connected to a charge-accumulating-type variable threshold transistor.
 15. The memory system according to claim 10, wherein each of the switch units includes a MOS transistor whose gate receives a control signal according to the predetermined probability.
 16. The memory system according to claim 15, wherein the gate of the MOS transistor in each of the switch units is connected to a resistive element.
 17. The memory system according to claim 15, wherein the gate of the MOS transistor in each of the switch units is connected to a charge-accumulating-type variable threshold transistor.
 18. A decoding device comprising: a probability acquirer configured to acquire a probability value for each bit of encoded data received; a check node processor configured to perform check node processing during in a decoding operation of the encoded data, the probability values being treated as initial variable nodes in the check node processing; and a converter configured to convert, into bit values, updated values of the probability values which are updated based on a result of the check node processing, wherein the check node processor includes a check node circuit having a topology corresponding to a two-state trellis diagram representing the check node processing, the check node circuit includes conducting wires each corresponding to an edge of the two-state trellis diagram and includes switch units which are arranged on the conducting wires and switching of which is controlled according to a predetermined probability. 